Tight Euler tours in uniform hypergraphs - computational aspects

By a tight tour in a k-uniform hypergraph H we mean any sequence of its vertices (w0, w1, . . . , ws−1) such that for all i = 0, . . . , s−1 the set ei = {wi, wi+1 . . . , wi+k−1} is an edge ofH (where operations on indices are computed modulo s) and the sets ei for i = 0, . . . , s − 1 are pairwise different. A tight tour in H is a tight Euler tour if it contains all edges ofH . We prove that the problem of deciding if a given 3-uniform hypergraph has a tight Euler tour is NP-complete (even if the maximum codegree of a pair of vertices is bounded by 4), and that it cannot be solved in time 2 (wherem is the number of edges in the input hypergraph), unless the ETH fails. We also present an exact exponential algorithm for the problem, whose time complexity matches this lower bound, and the space complexity is polynomial. In fact, this algorithm solves a more general problem of computing the number of tight Euler tours in a given uniform hypergraph.